Two-way digital driver/receiver uses one set of lines

Two-way /bilateral/ digital driver/receiver system using MOS circuits was designed for a multiprocess computer having several subsystems at relatively close locations. The system requires only a single set of communication lines between subsystems, thus achieving lower cost with increased reliability

Integrating personal values in your job: Transitioning from job desperation to job inspiration.

The changing nature of work is apparent in people’s desire to find meaning, purpose and flexibility in the workplace. How does this trend relate to the growing number of Millennials entering the working world? And what is the future role of identifying and integrating personal values in the work environment to enhance job satisfaction

Answer Set Planning Under Action Costs

Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language Kc, which extends the declarative planning language K by action costs. Kc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems under other optimality criteria, such as computing ``shortest'' plans (with the least number of steps), and refinement combinations of cheapest and fastest plans. We study complexity aspects of the language Kc and provide a transformation to logic programs, such that planning problems are solved via answer set programming. Furthermore, we report experimental results on selected problems. Our experience is encouraging that answer set planning may be a valuable approach to expressive planning systems in which intricate planning problems can be naturally specified and solved

Cognition as Embodied Morphological Computation

Cognitive science is considered to be the study of mind (consciousness and thought) and intelligence in humans. Under such definition variety of unsolved/unsolvable problems appear. This article argues for a broad understanding of cognition based on empirical results from i.a. natural sciences, self-organization, artificial intelligence and artificial life, network science and neuroscience, that apart from the high level mental activities in humans, includes sub-symbolic and sub-conscious processes, such as emotions, recognizes cognition in other living beings as well as extended and distributed/social cognition. The new idea of cognition as complex multiscale phenomenon evolved in living organisms based on bodily structures that process information, linking cognitivists and EEEE (embodied, embedded, enactive, extended) cognition approaches with the idea of morphological computation (info-computational self-organisation) in cognizing agents, emerging in evolution through interactions of a (living/cognizing) agent with the environment

Boundary quantum critical phenomena with entanglement renormalization

We extend the formalism of entanglement renormalization to the study of boundary critical phenomena. The multi-scale entanglement renormalization ansatz (MERA), in its scale invariant version, offers a very compact approximation to quantum critical ground states. Here we show that, by adding a boundary to the scale invariant MERA, an accurate approximation to the critical ground state of an infinite chain with a boundary is obtained, from which one can extract boundary scaling operators and their scaling dimensions. Our construction, valid for arbitrary critical systems, produces an effective chain with explicit separation of energy scales that relates to Wilson's RG formulation of the Kondo problem. We test the approach by studying the quantum critical Ising model with free and fixed boundary conditions.Comment: 8 pages, 12 figures, for a related work see arXiv:0912.289

Solid--on--Solid Model for Adsorption on Self--Affine Substrate: A Transfer Matrix Approach

We study a $d=2$ discrete solid--on--solid model of complete wetting of a rough substrate with random self--affine boundary, having roughness exponent $\zeta_s$. A suitable transfer matrix approach allows to discuss adsorption isotherms, as well as geometrical and thermal fluctuations of the interface. For $\zeta_s\leq 1/2$ the same wetting exponent $\psi=1/3$ as for flat substrate is obtained for the dependence of the coverage, $\theta$, on the chemical potential, $h$ ($\theta\sim h^{-\psi}$ for $h\to 0$). The expected existence of a zero temperature fixed point, leading to $\psi=\zeta_s /(2-\zeta_s)$ for $\zeta_s>1/2$, is verified numerically in spite of an unexpected, very slow convergence to asymptotics.Comment: Standard TeX, 13 pages. 5 PostScript figures available on request. Preprint UDPHIR 94/04/G

Simulation of anyons with tensor network algorithms

Interacting systems of anyons pose a unique challenge to condensed matter simulations due to their non-trivial exchange statistics. These systems are of great interest as they have the potential for robust universal quantum computation, but numerical tools for studying them are as yet limited. We show how existing tensor network algorithms may be adapted for use with systems of anyons, and demonstrate this process for the 1-D Multi-scale Entanglement Renormalisation Ansatz (MERA). We apply the MERA to infinite chains of interacting Fibonacci anyons, computing their scaling dimensions and local scaling operators. The scaling dimensions obtained are seen to be in agreement with conformal field theory. The techniques developed are applicable to any tensor network algorithm, and the ability to adapt these ansaetze for use on anyonic systems opens the door for numerical simulation of large systems of free and interacting anyons in one and two dimensions.Comment: Fixed typos, matches published version. 16 pages, 21 figures, 4 tables, RevTeX 4-1. For a related work, see arXiv:1006.247

Safety Performance Evaluation of the Steel Backed Wood Rail to Bridge Rail Transition

The safety performance of the Steel Backed Wood Rail to Bridge Rail Transition was evaluated as part of the federally sponsored Guardrail Testing Program II. During this evaluation, which included 5 full-scale vehicle crash tests, a number of modifications were made to improve the safety of the system. The tests were conducted, reported, and evaluated in accordance with requirements specified for guardrail to bridge rail transitions in the National Cooperative Highway Research Program (NCHRP) Report No. 230, Recommended Procedures for the Safety Performance Evaluation of Highway Appurtenances. Upon implementation of the design changes described herein, the performance of the Steel Backed Wood Rail to Bridge Rail Transition was determined to be acceptable according to these guidelines